Computing 2-Walks in Polynomial Time
نویسندگان
چکیده
منابع مشابه
Computing 2-Walks in Polynomial Time
A 2-walk of a graph is a walk visiting every vertex at least once and at most twice. By generalizing decompositions of Tutte and Thomassen, Gao, Richter and Yu proved that every 3-connected planar graph contains a closed 2-walk such that all vertices visited twice are contained in 3separators. This seminal result generalizes Tutte’s theorem that every 4-connected planar graph is Hamiltonian as ...
متن کاملComputing Sums of Radicals in Polynomial Time
For sums of radicals P k i=1 i d i p i, where i; i are elements of some real algebraic number eld Q(); d i p i 2 R; we present a deterministic polynomial time algorithm to decide whether the sum is zero. The time is polynomial in the number of bits required to represent , the i's, i's and di's. The algorithm can be extended to sums of complex radicals over certain complex algebraic number elds.
متن کاملQuantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to ‘postselect’ on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or probabilistic polynomial-time. Using this result, I show that several simple changes to the axioms of quantum mechanics would let us solve PP-complete problems efficiently. T...
متن کاملComputing (l, l)-isogenies in polynomial time on Jacobians of genus 2 curves
In this paper, we compute `-isogenies between abelian varieties over a field of characteristic different from 2 in polynomial time in `, when ` is an odd prime which is coprime to the characteristic. We use level n symmetric theta structure where n = 2 or n = 4. In a second part of this paper we explain how to convert between Mumford coordinates of Jacobians of genus 2 hyperelliptic curves to t...
متن کاملComputing (ℓ, ℓ)-isogenies in polynomial time on Jacobians of genus 2 curves
In this paper, we compute `-isogenies between abelian varieties over a field of characteristic different from 2 in polynomial time in `, when ` is an odd prime which is coprime to the characteristic. We use level n symmetric theta structure where n = 2 or n = 4. In a second part of this paper we explain how to convert between Mumford coordinates of Jacobians of genus 2 hyperelliptic curves to t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2018
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3183368